AUTOMORPHISMS OF METABELIAN PRIME POWER ORDER GROUPS OF MAXIMAL CLASS
نویسندگان
چکیده
منابع مشابه
Finite groups with $X$-quasipermutable subgroups of prime power order
Let $H$, $L$ and $X$ be subgroups of a finite group$G$. Then $H$ is said to be $X$-permutable with $L$ if for some$xin X$ we have $AL^{x}=L^{x}A$. We say that $H$ is emph{$X$-quasipermutable } (emph{$X_{S}$-quasipermutable}, respectively) in $G$ provided $G$ has a subgroup$B$ such that $G=N_{G}(H)B$ and $H$ $X$-permutes with $B$ and with all subgroups (with all Sylowsubgroups, respectively) $...
متن کاملAutomorphisms of P-groups of Maximal Class
Juhász has proved that the automorphism group of a group G of maximal class of order p, with p ≥ 5 and n > p + 1, has order divisible by p. We show that by translating the problem in terms of derivations, the result can be deduced from the case where G is metabelian. Here one can use a general result of Caranti and Scoppola concerning automorphisms of two-generator, nilpotent metabelian groups.
متن کاملFinite Groups with Fixed-point-free Automorphisms of Prime Order.
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملfinite groups with $x$-quasipermutable subgroups of prime power order
let $h$, $l$ and $x$ be subgroups of a finite group$g$. then $h$ is said to be $x$-permutable with $l$ if for some$xin x$ we have $al^{x}=l^{x}a$. we say that $h$ is emph{$x$-quasipermutable } (emph{$x_{s}$-quasipermutable}, respectively) in $g$ provided $g$ has a subgroup$b$ such that $g=n_{g}(h)b$ and $h$ $x$-permutes with $b$ and with all subgroups (with all sylowsubgroups, respectively) $v$...
متن کاملIntegral circulant graphs of prime power order with maximal energy
The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count n and a set D of divisors of n in such a way that they have vertex set Zn and edge set {{a, b} : a, b ∈ Zn, gcd(a− b, n) ∈ D}. Using tools from convex optimization, we study the maxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 2008
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972708000257